Infinite systems of first order PFDEs with mixed conditions
نویسندگان
چکیده
منابع مشابه
Infinite systems of first order PFDEs with mixed conditions
We consider mixed problems for infinite systems of first order partial functional differential equations. Infinite number of deviating functions is permitted, and the delay of an argument may depend also on spatial variable. A theorem on the existence of a solution and its continuous dependence upon initial boundary data is proved. The method of successive approximations is used in the existenc...
متن کاملFirst-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-order logic (MSO): in FO(R) one can demand that a node is reachably from another by some sequence of edges, whereas in FO(Reg) a regular set of allowed edge sequences can be given additionally. We study FO(Reg) logic in...
متن کاملFirst-Order Logic with Reachability Predicates over Infinite Systems
The general task in verification is to check whether a given (possibly infinite) system or structure satisfies a given specification. The specification is usually expressed by a logical formula in a fundamental logic like first-order (FO) predicate logic or monadic second-order (MSO) logic. A weakness of FO logic is that reachability properties, which are important in verification, are not defi...
متن کاملFirst order optimality conditions for generalized semi-infinite programming problems
In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...
متن کاملEfficient First-Order Temporal Logic for Infinite-State Systems
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Polonici Mathematici
سال: 2008
ISSN: 0066-2216,1730-6272
DOI: 10.4064/ap94-3-2